On new multivariate cryptosystems based on hidden Eulerian equations over finite fields
نویسنده
چکیده
We propose new multivariate cryptosystems over n-dimensional vector space over a finite field Fq based on idea of hidden discrete logarithm problem for F ∗ q. These cryptosystems are based on hidden eulerian equations x = a, (α, q − 1) = 1. The method is based on the idea of Eulerian transformations, which allow us to use asymmetric algorithms based on families of nonlinear multiplicatively injective maps of prescribed polynomial density and flexible degree. Mathematics Subject Classification (2010): 12Y05 12Y99 05C81 05C85 05C90 94A60 14G50 key words: Multivariate Cryptography, Finite Filds, Eulerian equations, Eulerian transformations, Linguistic Graphs, Multivariate Maps of Low Density 1 On Post Quantum and Multivariate Cryptography Post Quantum Cryptography serves for the research on asymmetrical cryptographical algorithms which can be potentially resistant against attacks based on the use of a quantum computer. The security of currently popular algorithms are based on the complexity of the following 3 known hard problems: integer factorisation, discrete logarithm problem, discrete logarithm for elliptic curves. Each of these problems can be solved in polynomial time by Peter Shor’s algorithm for theoretical quantum computer. Despite that the known nowadays small experimental examples of quantum computer are not able to attack currently used cryptographical algorithm, cryptographers have already started research on postquantum security. They have also count on the new results of general complexity theory. The history of international conferences on Post Quantum Cryptography (PQC) started in 2006. We have to notice that Post Quantum Cryptography differs from Quantum Cryptography, which is based on the idea of usage of quantum phenomena to reach better security. Modern PQC is divided into several directions such as Multivariate Cryptography, Lattice base Cryptography, Hash based Cryptography, Code based Cryptography, studies of isogenies for superelliptic curves.
منابع مشابه
Asymmetric Cryptography: Hidden Field Equations
The most popular public key cryptosystems rely on assumptions from algebraic number theory, e.g., the difficulty of factorisation or the discrete logarithm. The set of problems on which secure public key systems can be based is therefore very small: e.g., a breakthrough in factorisation would make RSA insecure and hence affect our digital economy quite dramatically. This would be the case if qu...
متن کاملAttacks to polynomial cryptosystems
In this paper we review some possible attacks to cryptosystems based on the problem of multivariate quadratic equations (MQ). After introducing the MQ problem and sketching schemes to generate private and public keys for these cryptosystems, we present well-known attacks based attacks based on the Gröbner bases computation to solve multivariate systems. The MQ problem The MQ problem consists in...
متن کاملMultivariate Public Key Cryptosystems
As the title says, this book is about Multivariate cryptography. Besides code-, latticeand hash-based cryptosystems, Multivariate cryptography is one of the main fields of cryptosystems which are believed to be secure against attacks with quantum computers. Multivariate cryptography deals with systems of nonlinear polynomial equations in several variables over a finite field which are difficult...
متن کاملPublic Key Cryptography Using Permutation P-polynomials over Finite Fields
In this paper we propose an efficient multivariate public key cryptosystem based on permutation p-polynomials over finite fields. We first characterize a class of permutation ppolynomials over finite fields Fqm and then construct a trapdoor function using this class of permutation p-polynomials. The complexity of encryption in our public key cryptosystem is O(m) multiplication which is equivale...
متن کاملA Construction of Public-Key Cryptosystem Based on Singular Simultaneous Equations
Extensive studies have been made of the public key cryptosystems based on multivariate polynomials over F2. However most of the proposed public key cryptosystems based on multivariate polynomials, are proved not secure. In this paper, we propose several types of new constructions of public key cryptosystems based on randomly generated singular simultaneous equations. One of the features of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2017 شماره
صفحات -
تاریخ انتشار 2017